Quantifying self-organization with optimal wavelets
نویسندگان
چکیده
منابع مشابه
Optimal Self-Organization
We present computational and analytical results indicating that systems of driven entities with repulsive interactions tend to reach an optimal state associated with minimal interaction and minimal dissipation. Using concepts from non-equilibrium thermodynamics and game theoretical ideas, we generalize this finding to an even wider class of selforganizing systems which have the ability to reach...
متن کاملQuantifying Self-Organization in Cyclic Cellular Automata
Cyclic cellular automata (CCA) are models of excitable media. Started from random initial conditions, they produce several different kinds of spatial structure, depending on their control parameters. We introduce new tools from information theory that let us calculate the dynamical information content of spatial random processes. This complexity measure allows us to quantitatively determine the...
متن کاملOptimal Tree Approximation with Wavelets
The more a priori knowledge we encode into a signal processing algorithm, the better performance we can expect. In this paper, we overview several approaches to capturing the structure of singularities (edges, ridges, etc.) in wavelet-based signal processing schemes. Leveraging results from approximation theory, we discuss nonlinear approximations on trees and point out that an optimal tree app...
متن کاملWavelets with Optimal Sobolev Regularity
Numerical optimization is used to construct new orthonormal compactly supported wavelets with Sobolev regularity exponent as high as possible among those mother wavelets with a fixed support length and a fixed number of vanishing moments. The increased regularity is obtained by optimizing the locations of the roots the scaling filter has on the interval (π/2, π). The results improve those obtai...
متن کاملGODDeS: Globally -Optimal Routing Via Distributed Decision-theoretic Self-organization
This paper introduces GODDeS: a fully distributed self-organizing decision-theoretic routing algorithm designed to effectively exploit high quality paths in lossy ad-hoc wireless environments, typically with a large number of nodes. The routing problem is modeled as an optimal control problem for a decentralized Markov Decision Process, with links characterized by locally known packet drop prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EPL (Europhysics Letters)
سال: 2013
ISSN: 0295-5075,1286-4854
DOI: 10.1209/0295-5075/102/40004